Ramsey-type graph coloring and diagonal non-computability
نویسندگان
چکیده
منابع مشابه
Ramsey-type graph coloring and diagonal non-computability
A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions play a central role in algorithmic randomness and reverse mathematics. Flood and Towsner asked for which functions h, the principle stating the existence of an h-bounded d.n.c. function (h-DNR) implies the Ramsey-type König’s lemma (RWKL). In this paper, we pro...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولDiagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems
This thesis focuses mainly on linear algebraic aspects of combinatorics. Let Nt(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M. Wilson and the author find the general formula for the Smith normal form or diagonal form of Nt(H) for all simple graphs H and for a very general class of t-uniform hypergraphs H. As a continu...
متن کاملThe Canonical Ramsey Theorem and Computability Theory
Using the tools of computability theory and reverse mathematics, we study the complexity of two partition theorems, the Canonical Ramsey Theorem of Erdös and Rado, and the Regressive Function Theorem of Kanamori and McAloon. Our main aim is to analyze the complexity of the solutions to computable instances of these problems in terms of the Turing degrees and the arithmetical hierarchy. We succe...
متن کاملOff-diagonal hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that every red-blue coloring of the k-subsets of {1, . . . , N} contains a red set of size s or a blue set of size n, where a set is red (blue) if all of its k-subsets are red (blue). A k-uniform tight path of size s, denoted by Ps, is a set of s vertices v1 < · · · < vs in Z, and all s−k+1 edges of the form {vj , vj+1, . . . , vj+k−1}. Let rk(Ps...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2015
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-015-0448-5